Graph Reconstruction with Degree-Constrained Subgraphs
نویسندگان
چکیده
Given observations about a collection of nodes, the goal of graph reconstruction is to predict a set of edges that connect the nodes in a realistic fashion. A number of similar formulations of the problem have been introduced across research areas, notably social sciences, epidemiology and biology. What is common across domains is the understanding that interesting properties of the system are known to depend on the graph structure.
منابع مشابه
Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings
The degree-constrained subgraphs decomposition problem, such as an f-coloring, an f-factorization, and a [ g, f ]-factorization, is to decompose a given graph G=(V, E) to edge-disjoint subgraphs degree-constrained by integer-valued functions f and g on V. In this paper we show that the problem can be simply reduced to the edge-coloring problem in polynomial-time. That is, for any positive integ...
متن کاملOn the reconstruction of the degree sequence
Harary’s edge reconstruction conjecture states that a graph G=(V; E) with at least four edges is uniquely determined by the multiset of its edge-deleted subgraphs, i.e. the graphs of the form G − e for e∈E. It is well-known that this multiset uniquely determines the degree sequence of a graph with at least four edges. In this note we generalize this result by showing that the degree sequence of...
متن کاملGraph Reconstruction - Some New Developments
The reconstruction conjecture claims that every graph on at least three vertices is uniquely determined by its collection of vertex deleted subgraphs. Even though it is one of the foremost unsolved problems in Graph Theory, work on it has slowed down, may be due to the general feeling that existing techniques are not likely to lead to a complete solution. Here we give the results that have appe...
متن کاملOn Decomposing Graphs of Large Minimum Degree into Locally Irregular Subgraphs
A locally irregular graph is a graph whose adjacent vertices have distinct degrees. We say that a graph G can be decomposed into k locally irregular subgraphs if its edge set may be partitioned into k subsets each of which induces a locally irregular subgraph in G. It has been conjectured that apart from the family of exceptions which admit no such decompositions, i.e., odd paths, odd cycles an...
متن کاملVertex-deleted and Edge-deleted Subgraphs
The foremost problem in this area of graph theory is the Reconstruction Conjecture which states that a graph is reconstructible from its collection of vertex-deleted subgraphs. In spite of several attempts to prove the conjecture only very partial results have been obtained. Several of these results do however bring to light interesting structural relationships between a graph and its subgraphs...
متن کامل